Trees with Given Diameter and Minimum Second Geometric–Arithmetic Index∗
نویسنده
چکیده
The second geometric-arithmetic index GA2(G) of a graph G was introduced recently by Fath-Tabar et al. [2] and is defined to be ∑ uv∈E(G) √ nu(e,G)nv(e,G) 1 2 [nu(e,G)+nv(e,G)] , where e = uv is one edge in G, and nu(e,G) denotes the number of vertices in G lying closer to u than to v. In this paper, we characterize the tree with the minimum GA2 index among the set of trees with given order and diameter. As applications, we deduce the trees with the minimum and second-minimum GA2 index among the set of trees of given order, respectively. In addition, all the trees minimizing the GA2 index have been shown to have minimum Szeged index and Wiener index, which deduced a result of [7] concerning the Wiener index of trees with given diameter.
منابع مشابه
The second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملOn Second Geometric-Arithmetic Index of Graphs
The concept of geometric-arithmetic indices (GA) was put forward in chemical graph theory very recently. In spite of this, several works have already appeared dealing with these indices. In this paper we present lower and upper bounds on the second geometric-arithmetic index (GA2) and characterize the extremal graphs. Moreover, we establish Nordhaus-Gaddum-type results for GA2.
متن کاملOn Third Geometric-Arithmetic Index of Graphs
Continuing the work K. C. Das, I. Gutman, B. Furtula, On second geometric-arithmetic index of graphs, Iran. J. Math Chem., 1(2) (2010) 17-28, in this paper we present lower and upper bounds on the third geometric-arithmetic index GA3 and characterize the extremal graphs. Moreover, we give Nordhaus-Gaddum-type result for GA3.
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملSome remarks on the arithmetic-geometric index
Using an identity for effective resistances, we find a relationship between the arithmetic-geometric index and the global ciclicity index. Also, with the help of majorization, we find tight upper and lower bounds for the arithmetic-geometric index.
متن کامل